Optimal Routing Among ⋅/M/1 Queues with Partial Information
نویسندگان
چکیده
منابع مشابه
Routing in Queues with Delayed Information
We compare two routing-control strategies in a high-speed communication network with c parallel channels (routes), where information on service completions in down-stream servers is randomly delayed. The controller can either hold arriving messages in a common buffer, dispatching them to servers only when the delayed information becomes available (Wait option), or route jobs to the various chan...
متن کاملOptimal Routing in Closed Queueing Networks with State Dependent Queues
Optimal routing in closed queueing networks with state dependent queues is the focus of this paper. We seek a methodology and algorithm to efficiently solve the routing probabilities in closed systems. These systems may include multi-server exponential and general service finite capacity state dependent models as well as multi-chain systems. The state dependent models included within this paper...
متن کاملOptimal Routing in Several Deterministic Queues with Two Service Times
In this article we present some extensions of optimal routing problems for parallel deterministic queues. Our goal is to minimize the sojourn time of the customers in the system. The cases studied are two parallel queues and N parallel queues. RÉSUMÉ. Cet article présente diverses extentions des problèmes de routages optimaux dans des files d’attentes déterministes en parallèle. Notre objectif ...
متن کاملGeographic Routing with Partial Position Information
Geographic routing protocols show good properties for Wireless Sensor Networks (WSN). They are stateless, local and scalable. However they require that each node of the network is aware of its own position. While it may be possible to equip each node with GPS receiver, even if it is costly, there are some issues and receiving a usable GPS signal may be difficult in some situations. For these re...
متن کاملOptimal routing policies in deterministic queues in tandem
In this paper, we address the problem of routing a stream of customers in two parallel networks of queues in tandem with deterministic service times in order to minimize the average response time of the whole system. We show that the optimal routing is a Sturmian word which density depends on maximum service time on each route. In order to do this, we particularly study the output process of de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Models
سال: 2004
ISSN: 1532-6349,1532-4214
DOI: 10.1081/stm-120034126